Successful Pressing Sequences for a Bicolored Graph and Binary Matrices
نویسندگان
چکیده
We apply matrix theory over F2 to understand the nature of socalled “successful pressing sequences” of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result of Hannenhalli and Pevzner, the space of sortingsby-reversal of a signed permutation can be described by pressing sequences. In particular, we offer several alternative linear-algebraic and graph-theoretic characterizations of successful pressing sequences, describe the relation between such sequences, and provide bounds on the number of them. We also offer several open problems that arose as a result of the present work. MSC classes: 05C50, 15B33, 92D15.
منابع مشابه
Connectivity of Successful Pressing Sequences for a Bicolored Graph
We resolve the “Pressing Game Conjecture” arising from computational phylogenetics, showing that so-called “successful pressing sequences” of bicolored graphs is explorable by two-point edits alone. By a celebrated result of Hannenhalli and Pevzner, this implies that the space of sortings-by-reversal of a signed permutation is connected by minimal local alterations. Therefore, a Markov chain ma...
متن کاملA Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.
متن کاملProving the Pressing Game Conjecture on Linear Graphs
The pressing game on black-and-white graphs is the following: Given a graph G(V,E) with its vertices colored with black and white, any black vertex v can be pressed, which has the following effect: (a) all neighbors of v change color, i.e. white neighbors become black and vice versa, (b) all pairs of neighbors of v change connectivity, i.e. connected pairs become unconnected, unconnected ones b...
متن کاملOn the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
The principal permanent rank characteristic sequence is a binary sequence r0r1 · · · rn where rk = 1 if there exists a principal square submatrix of size k with nonzero permanent and rk = 0 otherwise, and r0 = 1 if there is a zero diagonal entry. A characterization is provided for all principal permanent rank sequences obtainable by the family of nonnegative matrices as well as the family of no...
متن کاملA lagrangean approach to reconstruct bicolored images from discrete orthogonal projections
The problem of reconstructing bicolored images from their orthogonal projections is studied. A binary integer programming model is formulated to build small size bicolored images with smoothness properties. Since the problem is NP-complete, we provide an iterative approximation based on lagrangean relaxation. Keyword: Discrete Tomography; Images Reconstruction; Lagrangean Relaxation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015